Characterizing which powers of hypercubes and folded hypercubes are divisor graphs
نویسندگان
چکیده
In this paper, we show that Q n is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Q n is a divisor graph iff k ≥ n− 1. For folded-hypercube, we get FQn is a divisor graph when n is odd. But, if n ≥ 4 is even integer, then FQn is not a divisor graph. For n ≥ 5, we show that (FQn) k is not a divisor graph, where 2 ≤ k ≤ ⌈ 2 ⌉ − 1.
منابع مشابه
Cayley graphs and symmetric interconnection networks
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley graphs. We then discuss automorphism groups of Cayley graphs. We prove that the vertex-connectivity of edge-transitive graphs is maximum possible. We investigate ...
متن کاملA general technique to establish the asymptotic conditional diagnosability of interconnection networks
We develop a general and demonstrably widely applicable technique for determining the asymptotic conditional diagnosability of interconnection networks prevalent within parallel computing under the comparison diagnosis model. We apply our technique to replicate (yet extend) existing results for hypercubes and k-ary n-cubes before going on to obtain new results as regards folded hypercubes, panc...
متن کاملEfficient Embeddings into Hypercube-like Topologies
Embeddings of various graph classes into hypercubes have been widely studied. Almost all these classes are regularly structured graphs such as meshes, complete trees or pyramids. In this paper, we present a general method for one-to-one embeddings of irregularly structured graphs into their optimal hypercubes, based on extended edge bisectors of graphs. An extended edge bisector is an edge bise...
متن کاملNovel Hierarchical Interconnection Networks for High-Performance Multicomputer Systems
This paper proposes several novel hierarchical interconnection networks based on Heawood graphs, namely, folded Heawood networks, root-folded Heawood networks, recursively expanded Heawood networks, and flooded Heawood networks. Like hypercubes and networks extended from Petersen networks, these hierarchical Heawood networks have the following properties: regular topology, high scalability, and...
متن کاملImplementation of Four Common Functions on an LNS Co-Processor
[9] C.-T. Ho, “ Full bandwidth communications on folded hypercubes,” in Proc. Int. Con5 Parallel Processing, vol. I, Penn State, 1989, pp. 276280. [IO] -, “An observation on the bisectional interconnection networks,” IEEE Trans. Compui., vol. 41, no. 7, pp. 873-877, July 1992. [ I I ] S. Latifi and A. El-Amawy, “on folded hypercubes,” in Proc. Int. Con5 Parallel Processing, vol. 1, Penn State, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 35 شماره
صفحات -
تاریخ انتشار 2015